Subset Sums modulo a Prime
نویسندگان
چکیده
Let Zp be the finite field of prime order p and A be a subset of Zp. We prove several sharp results about the following two basic questions: (1) When can one represent zero as a sum of distinct elements of A ? (2) When can one represent every element of Zp as a sum of distinct elements of A ?
منابع مشابه
Subset Sum \cubes" and the Complexity of Prime Testing
Suppose a 1 < a 2 < : : : < a Z are distinct integers in f1; : : :; N g. If a 0 +" 1 a 1 +" 2 a 2 + + " Z a Z is prime for all choices of " 1 ; " 2 ; : : : ; " Z 2 f0; 1g, then Z (9=2 + o(1)) log N= log log N. The argument uses a modiied form of Gallagher's Larger Sieve, and shows that if Z > (9=2 + o(1)) log N= log log N , then for some prime p < Z 2 , the subset sums " 1 a 1 + " 2 a 2 + + " Z...
متن کاملTwisted Monomial Gauss Sums modulo Prime Powers
We show that twisted monomial Gauss sums modulo prime powers can be evaluated explicitly once the power is sufficiently large.
متن کاملLaced Boolean functions and subset sum problems in finite fields
In this paper, we investigate some algebraic and combinatorial properties of a special Boolean function on n variables, defined using weighted sums in the residue ring modulo the least prime p ≥ n. We also give further evidence to a question raised by Shparlinski regarding this function, by computing accurately the Boolean sensitivity, thus settling the question for prime number values p = n. F...
متن کاملNew Results on Subset Sums 3
In this paper we give a survey of recent results on sumsets of subsets of a field with polynomial restrictions. Let F be a field and let F× be the multiplicative group F \ {0}. The additive order of the (multiplicative) identity of F is either infinite or a prime, we call it the characteristic of F . Let A and B be finite subsets of the field F . Set A+B = {a+ b: a ∈ A and b ∈ B} and AuB = {a+ ...
متن کاملOn a Congruence Modulo n Involving Two Consecutive Sums of Powers
For various positive integers k, the sums of kth powers of the first n positive integers, Sk(n) := 1 k+2k+ · · ·+nk, are some of the most popular sums in all of mathematics. In this note we prove a congruence modulo n3 involving two consecutive sums S2k(n) and S2k+1(n). This congruence allows us to establish an equivalent formulation of Giuga’s conjecture. Moreover, if k is even and n ≥ 5 is a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009